On constructing a shortest linear recurrence relation
نویسندگان
چکیده
منابع مشابه
ON CONSTRUCTING A SHORTEST LINEAR RECURRENCE RELATION - Decision and Control, 1995., Proceedings of the 34th IEEE Conference on
In 1968, Berlekamp and Massey presented an algorithm to compute a shortest linear recurrence relation for a finite sequence of numbers. It was originally designed for the purpose of decoding certain types of block codes. It later became important for cryptographic applications, namely for determining the complexity profile of a sequence of numbers. Here, we interpret the Berlekamp-Massey algori...
متن کاملAn algorithm for computing a shortest linear recurrence relation for a sequence of matrices: general - Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on
The Berlekamp-Massey a lgor i thm (1968) i teratively constructs a shor tes t linear recurrence relation for a finite sequence of numbers. Here we present a system-theoretic explana t ion of t h e algor i t h m as well as an extension that cons t ruc ts a shortest linear recurrence relation for a finite sequence of matrices, r a t h e r than numbers. Originally designed for decoding BCH/Reed-So...
متن کاملon the effect of linear & non-linear texts on students comprehension and recalling
چکیده ندارد.
15 صفحه اولSelf-Constructing Clusters Based on Similarity Relation
Many techniques for cluster analysis have been proposed for the last 40 years. It seems that the following three methods have been frequently appearing in the practical applications. The first is a hierarchical method, which represents the clustering process by a dendrogram (Lance, et al.,1967). This method has been most frequently used still now for intuitively understandable. The second one i...
متن کاملOn Nearly Linear Recurrence Sequences
A nearly linear recurrence sequence (nlrs) is a complex sequence (an) with the property that there exist complex numbers A0,. . ., Ad−1 such that the sequence ( an+d + Ad−1an+d−1 + · · · + A0an )∞ n=0 is bounded. We give an asymptotic Binet-type formula for such sequences. We compare (an) with a natural linear recurrence sequence (lrs) (ãn) associated with it and prove under certain assumptions...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Automatic Control
سال: 1997
ISSN: 0018-9286,1558-2523
DOI: 10.1109/9.649704